Smoothed heights of tries and patricia tries
نویسندگان
چکیده
منابع مشابه
Expected External Profile of PATRICIA Tries
We consider PATRICIA tries on n random binary strings generated by a memoryless source with parameter p ≥ 1 2 . For both the symmetric (p = 1/2) and asymmetric cases, we analyze asymptotics of the expected value of the external profile at level k = k(n), defined to be the number of leaves at level k. We study three natural ranges of k with respect to n. For k bounded, the mean profile decays ex...
متن کاملAsymmetric Rényi Problem and PATRICIA Tries
In 1960 Rényi asked for the number of random queries necessary to recover a hidden bijective labeling of n distinct objects. In each query one selects a random subset of labels and asks, what is the set of objects that have these labels? We consider here an asymmetric version of the problem in which in every query an object is chosen with probability p > 1/2 and we ignore “inconclusive” queries...
متن کاملMining Frequent Itemsets using Patricia Tries
We present a depth-first algorithm, PatriciaMine, that discovers all frequent itemsets in a dataset, for a given support threshold. The algorithm is main-memory based and employs a Patricia trie to represent the dataset, which is space efficient for both dense and sparse datasets, whereas alternative representations were adopted by previous algorithms for these two cases. A number of optimizati...
متن کاملApproximate Orthogonal Range Search using Patricia Tries
We use Patricia tries to answer 2-approximate orthogonal range search on a set of n random points and rectangles in k-dimensional space. Given n k-dimensional random points or rectangles and a k-dimensional query rectangle, 2-approximate orthogonal range query counts (or reports) the points in the query rectangle or the rectangles intersecting the query rectangle, allowing errors near the bound...
متن کاملA Multivariate Study on the Size of m-ary Tries and PATRICIA Tries
Tries and PATRICIA tries are fundamental data structures in computer science with numerous applications. In a recent paper, a general framework for obtaining the mean and variance of additive shape parameters of tries and PATRICIA tries under the Bernoulli model was proposed. In this note, we show that a slight modification of this framework yields limit laws as well. As an application, we cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.02.009